Adaptive fast multipole methods on the GPU
نویسندگان
چکیده
منابع مشابه
Dynamic Autotuning of Adaptive Fast Multipole Methods on Hybrid Multicore CPU and GPU Systems
We discuss an implementation of adaptive fast multipole methods targeting hybrid multicore CPUand GPU-systems. From previous experiences with the computational profile of our version of the fast multipole algorithm, suitable parts are off-loaded to the GPU, while the remaining parts are threaded and executed concurrently by the CPU. The parameters defining the algorithm affects the performance ...
متن کاملGPU ccelerated Fast Multipole Methods for Dynamic N -body Simulation
Many physics based simulations can be efficiently and accurately performed using particle methods which focus computational resources at the location of sources or discontinuities (particles), and evaluation of relevant fields at locations of interest. These particle methods result in the so-called N -body problem, in which the sum of N kernel functions Φ centered at N source locations xi with ...
متن کاملToward Fast Multipole Methods on a Lattice
We discuss the concept and implementation of fast multipole algorithms on a regular structured grid. In doing so, the discrte analogue of the continuous fundamental solution is evaluated numerically. We discuss the concept and implementation of fast multipole algorithms on a regular structured grid. In doing so, the discrte analogue of the continuous fundamental solution is evaluated numericall...
متن کاملA short course on fast multipole methods
In this series of lectures, we describe the analytic and computational foundations of fast multipole methods, as well as some of their applications. They are most easily understood, perhaps, in the case of particle simulations, where they reduce the cost of computing all pairwise interactions in a system of N particles from O(N) to O(N) or O(N logN) operations. They are equally useful, however,...
متن کاملFast multipole methods on graphics processors
The Fast Multipole Method allows the rapid evaluation of sums of radial basis functions centered at points distributed inside a computational domain at a large number of evaluation points to a specified accuracy . The method scales as O (N) in both time and memory compared to the direct method with complexity O(N), which allows the solution of larger problems with given resources. Graphical pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2012
ISSN: 0920-8542,1573-0484
DOI: 10.1007/s11227-012-0836-0